Linear programming with multiple objective functions: Step method (stem)

i This paper describes a solution technique mr Linear Programming problems with multiple objective functions. In this type of problem it is often necessary to replace the concept of "optimgm" with that of "best compromise". In contrast with methods dealing with a priori weighted sums of the objective functions, the method described here involves a sequential exploration of solutions. This exploration is guided to some extent by the decision maker who intervenes by means of defined responses to precise questions posed by the algorithm. Thus, in this man-model symbiosis, phases of computation alternate with phases of decision. The process allows the decision-maker to "learn" to recognize good solutions and the relative importance of the objectives. The final decision (best compromise) furnished by the man-model system is obtained after a small number of successive phases.